Covering Numbers in Covering-Based Rough Sets
نویسندگان
چکیده
Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-based rough sets which are generalizations of rough sets. With covering numbers, we establish a distance structure, two semilattices and a lattice for covering-based rough sets. The new concepts are helpful in studying covering-based rough sets from topological and algebraical viewpoints.
منابع مشابه
Multigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making
In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...
متن کاملCovering-based Rough sets Based on the Refinement of Covering-element
Covering-based rough sets is an extension of rough sets and it is based on a covering instead of a partition of the universe. Therefore it is more powerful in describing some practical problems than rough sets. However, by extending the rough sets, covering-based rough sets can increase the roughness of each model in recognizing objects. How to obtain better approximations from the models of a ...
متن کاملCovering-based fuzzy rough sets
Many researchers have combined rough set theory and fuzzy set theory in order to easily approach problems of imprecision and uncertainty. Covering-based rough sets are one of the important generalizations of classical rough sets. Naturally, covering-based fuzzy rough sets can be studied as a combination of covering-based rough set theory and fuzzy set theory. It is clear that Pawlak’s rough set...
متن کاملEquivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets
Covering is a widely used form of data structures. Covering-based rough set theory provides a systematic approach to this data. In this paper, graphs are connected with covering-based rough sets. Specifically, we convert some important concepts in graph theory including vertex covers, independent sets, edge covers, and matchings to ones in covering-based rough sets. At the same time, correspond...
متن کاملOn topological covering-based rough spaces
Rough set theory, a mathematical tool to deal with vague concepts, has originally described the indiscernibility of elements by equivalence relations. Covering-based rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as subbase, neighborhood and separation axioms have bee...
متن کامل